0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.34	% Computer   : n021.cluster.edu
0.12/0.34	% Model      : x86_64 x86_64
0.12/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory     : 8042.1875MB
0.12/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1200
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Jul 13 12:25:10 EDT 2021
0.12/0.34	% CPUTime    : 
0.12/0.34	% Number of cores: 8
0.12/0.34	% Python version: Python 3.6.8
0.12/0.34	# Version: 2.6rc1-ho
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 59 seconds
0.20/0.38	# AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S00A
0.20/0.38	# and selection function NoSelection.
0.20/0.38	#
0.20/0.38	# Preprocessing time       : 0.030 s
0.20/0.38	# Presaturation interreduction done
0.20/0.38	
0.20/0.38	# Failure: Out of unprocessed clauses!
0.20/0.38	# Parsed axioms                        : 2
0.20/0.38	# Removed by relevancy pruning/SinE    : 0
0.20/0.38	# Initial clauses                      : 10
0.20/0.38	# Removed in clause preprocessing      : 1
0.20/0.38	# Initial clauses in saturation        : 9
0.20/0.38	# Processed clauses                    : 35
0.20/0.38	# ...of these trivial                  : 0
0.20/0.38	# ...subsumed                          : 0
0.20/0.38	# ...remaining for further processing  : 35
0.20/0.38	# Other redundant clauses eliminated   : 9
0.20/0.38	# Clauses deleted for lack of memory   : 0
0.20/0.38	# Backward-subsumed                    : 0
0.20/0.38	# Backward-rewritten                   : 0
0.20/0.38	# Generated clauses                    : 45
0.20/0.38	# ...of the previous two non-trivial   : 17
0.20/0.38	# Contextual simplify-reflections      : 1
0.20/0.38	# Paramodulations                      : 8
0.20/0.38	# Factorizations                       : 0
0.20/0.38	# NegExts                              : 4
0.20/0.38	# Equation resolutions                 : 9
0.20/0.38	# Propositional unsat checks           : 0
0.20/0.38	#    Propositional check models        : 0
0.20/0.38	#    Propositional check unsatisfiable : 0
0.20/0.38	#    Propositional clauses             : 0
0.20/0.38	#    Propositional clauses after purity: 0
0.20/0.38	#    Propositional unsat core size     : 0
0.20/0.38	#    Propositional preprocessing time  : 0.000
0.20/0.38	#    Propositional encoding time       : 0.000
0.20/0.38	#    Propositional solver time         : 0.000
0.20/0.38	#    Success case prop preproc time    : 0.000
0.20/0.38	#    Success case prop encoding time   : 0.000
0.20/0.38	#    Success case prop solver time     : 0.000
0.20/0.38	# Current number of processed clauses  : 22
0.20/0.38	#    Positive orientable unit clauses  : 2
0.20/0.38	#    Positive unorientable unit clauses: 0
0.20/0.38	#    Negative unit clauses             : 3
0.20/0.38	#    Non-unit-clauses                  : 17
0.20/0.38	# Current number of unprocessed clauses: 0
0.20/0.38	# ...number of literals in the above   : 0
0.20/0.38	# Current number of archived formulas  : 0
0.20/0.38	# Current number of archived clauses   : 13
0.20/0.38	# Clause-clause subsumption calls (NU) : 77
0.20/0.38	# Rec. Clause-clause subsumption calls : 59
0.20/0.38	# Non-unit clause-clause subsumptions  : 1
0.20/0.38	# Unit Clause-clause subsumption calls : 2
0.20/0.38	# Rewrite failures with RHS unbound    : 0
0.20/0.38	# BW rewrite match attempts            : 0
0.20/0.38	# BW rewrite match successes           : 0
0.20/0.38	# Condensation attempts                : 0
0.20/0.38	# Condensation successes               : 0
0.20/0.38	# Termbank termtop insertions          : 1141
0.20/0.38	# No success with AutoSched0
0.20/0.38	# Trying AutoSched1 for 26 seconds
0.20/0.41	# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
0.20/0.41	# and selection function PSelectComplexExceptUniqMaxHorn.
0.20/0.41	#
0.20/0.41	# Preprocessing time       : 0.029 s
0.20/0.41	# Presaturation interreduction done
0.20/0.41	
0.20/0.41	# Proof found!
0.20/0.41	# SZS status Theorem
0.20/0.41	# SZS output start CNFRefutation
0.20/0.41	thf(cTHM631A_pme, conjecture, (![X1:$i > $o, X2:$i > $o]:(cK @ (^[X3:$i]:(X2 @ X3|X1 @ X3)))=(^[X4:$i]:(cK @ X1 @ X4|cK @ X2 @ X4))=>![X1:$i > $o, X2:$i > $o]:(![X5:$i]:(X1 @ X5=>X2 @ X5)=>![X5:$i]:(cK @ X2 @ X5<=cK @ X1 @ X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM631A_pme)).
0.20/0.41	thf(c_0_1, plain, ![X3:$i, X1:$i > $o, X2:$i > $o]:(epred1_3 @ X2 @ X1 @ X3<=>(X2 @ X3|X1 @ X3)), introduced(definition)).
0.20/0.41	thf(c_0_2, negated_conjecture, ~((![X1:$i > $o, X2:$i > $o, X4:$i]:(cK @ (epred1_3 @ X2 @ X1) @ X4<=>(cK @ X1 @ X4|cK @ X2 @ X4))=>![X1:$i > $o, X2:$i > $o]:(![X5:$i]:(X1 @ X5=>X2 @ X5)=>![X5:$i]:(cK @ X1 @ X5=>cK @ X2 @ X5)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM631A_pme])]), c_0_1])])).
0.20/0.41	thf(c_0_3, negated_conjecture, ![X12:$i > $o, X13:$i > $o, X14:$i, X17:$i]:(((~cK @ (epred1_3 @ X13 @ X12) @ X14|(cK @ X12 @ X14|cK @ X13 @ X14))&((~cK @ X12 @ X14|cK @ (epred1_3 @ X13 @ X12) @ X14)&(~cK @ X13 @ X14|cK @ (epred1_3 @ X13 @ X12) @ X14)))&((~epred2_0 @ X17|epred3_0 @ X17)&(cK @ epred2_0 @ esk1_0&~cK @ epred3_0 @ esk1_0))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])).
0.20/0.41	thf(c_0_4, negated_conjecture, ~cK @ epred3_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.41	thf(c_0_5, negated_conjecture, ![X1:$i > $o, X2:$i > $o, X3:$i]:(cK @ (epred1_3 @ X2 @ X1) @ X3|~cK @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.41	thf(c_0_6, plain, ![X1:$i > $o, X2:$i > $o]:((epred1_3 @ X1 @ X2)!=(epred3_0)|~cK @ X2 @ esk1_0), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_4, c_0_5])])).
0.20/0.41	thf(c_0_7, plain, ![X1:$i > $o, X2:$i > $o]:((epred1_3 @ X1 @ X2 @ (esk3_2 @ X1 @ X2))!=(epred3_0 @ (esk3_2 @ X1 @ X2))|~cK @ X2 @ esk1_0), inference(neg_ext,[status(thm)],[c_0_6])).
0.20/0.41	thf(c_0_8, plain, ![X19:$i, X20:$i > $o, X21:$i > $o]:((~epred1_3 @ X21 @ X20 @ X19|(X21 @ X19|X20 @ X19))&((~X21 @ X19|epred1_3 @ X21 @ X20 @ X19)&(~X20 @ X19|epred1_3 @ X21 @ X20 @ X19))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])).
0.20/0.41	thf(c_0_9, plain, ![X1:$i > $o, X2:$i > $o]:(epred1_3 @ X1 @ X2 @ (esk3_2 @ X1 @ X2)|epred3_0 @ (esk3_2 @ X1 @ X2)|~cK @ X2 @ esk1_0), inference(dynamic cnf,[status(thm)],[c_0_7])).
0.20/0.41	thf(c_0_10, negated_conjecture, cK @ epred2_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.41	thf(c_0_11, plain, ![X1:$i > $o, X2:$i > $o, X3:$i]:(X1 @ X3|X2 @ X3|~epred1_3 @ X1 @ X2 @ X3), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.41	thf(c_0_12, negated_conjecture, ![X1:$i > $o]:(epred1_3 @ X1 @ epred2_0 @ (esk3_2 @ X1 @ epred2_0)|epred3_0 @ (esk3_2 @ X1 @ epred2_0)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.41	thf(c_0_13, negated_conjecture, ![X3:$i]:(epred3_0 @ X3|~epred2_0 @ X3), inference(split_conjunct,[status(thm)],[c_0_3])).
0.20/0.41	thf(c_0_14, plain, ![X1:$i > $o, X2:$i > $o]:(~epred1_3 @ X1 @ X2 @ (esk3_2 @ X1 @ X2)|~epred3_0 @ (esk3_2 @ X1 @ X2)|~cK @ X2 @ esk1_0), inference(dynamic cnf,[status(thm)],[c_0_7])).
0.20/0.41	thf(c_0_15, plain, ![X1:$i > $o, X2:$i > $o, X3:$i]:(epred1_3 @ X1 @ X2 @ X3|~X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.41	thf(c_0_16, plain, ![X1:$i > $o]:(epred3_0 @ (esk3_2 @ X1 @ epred2_0)|X1 @ (esk3_2 @ X1 @ epred2_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])).
0.20/0.41	thf(c_0_17, plain, ![X1:$i > $o, X2:$i > $o]:(~epred3_0 @ (esk3_2 @ X1 @ X2)|~cK @ X2 @ esk1_0|~X1 @ (esk3_2 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.41	thf(c_0_18, plain, epred3_0 @ (esk3_2 @ epred3_0 @ epred2_0), inference(ef,[status(thm)],[c_0_16])).
0.20/0.41	thf(c_0_19, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_10]), c_0_18])]), ['proof']).
0.20/0.41	# SZS output end CNFRefutation
0.20/0.41	# Proof object total steps             : 20
0.20/0.41	# Proof object clause steps            : 15
0.20/0.41	# Proof object formula steps           : 5
0.20/0.41	# Proof object conjectures             : 8
0.20/0.41	# Proof object clause conjectures      : 5
0.20/0.41	# Proof object formula conjectures     : 3
0.20/0.41	# Proof object initial clauses used    : 6
0.20/0.41	# Proof object initial formulas used   : 1
0.20/0.41	# Proof object generating inferences   : 5
0.20/0.41	# Proof object simplifying inferences  : 5
0.20/0.41	# Training examples: 0 positive, 0 negative
0.20/0.41	# Parsed axioms                        : 2
0.20/0.41	# Removed by relevancy pruning/SinE    : 0
0.20/0.41	# Initial clauses                      : 10
0.20/0.41	# Removed in clause preprocessing      : 1
0.20/0.41	# Initial clauses in saturation        : 9
0.20/0.41	# Processed clauses                    : 53
0.20/0.41	# ...of these trivial                  : 0
0.20/0.41	# ...subsumed                          : 6
0.20/0.41	# ...remaining for further processing  : 47
0.20/0.41	# Other redundant clauses eliminated   : 16
0.20/0.41	# Clauses deleted for lack of memory   : 0
0.20/0.41	# Backward-subsumed                    : 0
0.20/0.41	# Backward-rewritten                   : 0
0.20/0.41	# Generated clauses                    : 95
0.20/0.41	# ...of the previous two non-trivial   : 51
0.20/0.41	# Contextual simplify-reflections      : 4
0.20/0.41	# Paramodulations                      : 41
0.20/0.41	# Factorizations                       : 8
0.20/0.41	# NegExts                              : 5
0.20/0.41	# Equation resolutions                 : 16
0.20/0.41	# Propositional unsat checks           : 0
0.20/0.41	#    Propositional check models        : 0
0.20/0.41	#    Propositional check unsatisfiable : 0
0.20/0.41	#    Propositional clauses             : 0
0.20/0.41	#    Propositional clauses after purity: 0
0.20/0.41	#    Propositional unsat core size     : 0
0.20/0.41	#    Propositional preprocessing time  : 0.000
0.20/0.41	#    Propositional encoding time       : 0.000
0.20/0.41	#    Propositional solver time         : 0.000
0.20/0.41	#    Success case prop preproc time    : 0.000
0.20/0.41	#    Success case prop encoding time   : 0.000
0.20/0.41	#    Success case prop solver time     : 0.000
0.20/0.41	# Current number of processed clauses  : 35
0.20/0.41	#    Positive orientable unit clauses  : 5
0.20/0.41	#    Positive unorientable unit clauses: 0
0.20/0.41	#    Negative unit clauses             : 5
0.20/0.41	#    Non-unit-clauses                  : 25
0.20/0.41	# Current number of unprocessed clauses: 15
0.20/0.41	# ...number of literals in the above   : 38
0.20/0.41	# Current number of archived formulas  : 0
0.20/0.41	# Current number of archived clauses   : 12
0.20/0.41	# Clause-clause subsumption calls (NU) : 116
0.20/0.41	# Rec. Clause-clause subsumption calls : 90
0.20/0.41	# Non-unit clause-clause subsumptions  : 8
0.20/0.41	# Unit Clause-clause subsumption calls : 6
0.20/0.41	# Rewrite failures with RHS unbound    : 0
0.20/0.41	# BW rewrite match attempts            : 0
0.20/0.41	# BW rewrite match successes           : 0
0.20/0.41	# Condensation attempts                : 0
0.20/0.41	# Condensation successes               : 0
0.20/0.41	# Termbank termtop insertions          : 1728
0.20/0.41	
0.20/0.41	# -------------------------------------------------
0.20/0.41	# User time                : 0.059 s
0.20/0.41	# System time              : 0.008 s
0.20/0.41	# Total time               : 0.067 s
0.20/0.41	# Maximum resident set size: 1632 pages
0.20/0.41	EOF